//
// Created by sai on 2019/4/16.
//

#include "bucketsort.h"

bool isLast(Position node) {
    return node->next == NULL;
}

bool isEmpty(List list) {
    return list->next == NULL;
}

List makeEmpty() {
    List head;
    head = malloc(sizeof(struct Node));
    head->next = NULL;
    return head;
}

Position find(ElemType data, List list) {
    Position pos;
    pos = list->next;
    while (pos != NULL && pos->data != data)
        pos = pos->next;
    return pos
}
Position findPrevious(ElemType data,List list){
    Position pos;
    pos=list->next;
    
}